On Almost Deterministic Timed Automata
نویسندگان
چکیده
منابع مشابه
Learning of Event-Recording Automata
In regular inference, a regular language is inferred from answers to a finite set of membership queries, each of which asks whether the language contains a certain word. One of the most well-known regular inference algorithms is the L∗ algorithm due to Dana Angluin. However, there are almost no extensions of these algorithms to the setting of timed systems. We extend Angluin’s algorithm for on-...
متن کاملThe Timestamp of Timed Automata
Given a non-deterministic timed automaton with silent transitions (eNTA), we show that after an initial stage it becomes timeperiodic. After computing the periodic parameters, we construct a finite almost periodic augmented region automaton, which includes a clock measuring the global time. In the next step we construct the timestamp of the automaton: the union of all its observable timed trace...
متن کاملThe efficiency of identifying timed automata and the power of clocks
We develop theory on the efficiency of identifying (learning) timed automata. In particular, we show that: i) deterministic timed automata cannot be identified efficiently in the limit from labeled data, and ii) that one-clock deterministic timed automata can be identified efficiently in the limit from labeled data. We prove these results based on the distinguishability of these classes of time...
متن کاملInference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership queries, each of which asks whether the language contains a certain word. There are many algorithms for learning DFAs, the most well-known being the L algorithm due to Dana Angluin. However, there are almost no extensions of...
متن کاملSynchronizing Words for Weighted and Timed Automata
The problem of synchronizing automata is concerned with the existence of a word that sends all states of the automaton to one and the same state. This problem has classically been studied for complete deterministic finite automata, with the existence problem being NLOGSPACE-complete. In this paper we consider synchronizing-word problems for weighted and timed automata. We consider the synchroni...
متن کامل